Hierarchal maximum information rate enforcement

ABSTRACT

A communication system may be configured to transmit information from one or more information sources to a plurality of users over limited capacity media while enforcing one or more Quality of Service policies, such as maximum information rate (MIR) policies. Methods are presented herein for enforcing maximum information rate on two or more levels in a hierarchal and extendable manner, for at least the purposes of maximizing utilization of available capacity over said media and of fair distributing said capacity between all users. Also presented herein is a method for estimating load over said media.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S. patentapplication Ser. No. 13/900,630, filed May 23, 2013 and entitled“Hierarchal Maximum Information Rate Enforcement,” which claims priorityto U.S. Provisional Application Ser. No. 61/651,402, filed May 24, 2012and entitled “Hierarchal Maximum Information Rate Enforcement.” Thecontents of the aforementioned applications are hereby incorporated byreference herein in their entirety.

FIELD OF THE INVENTION

Aspects of the disclosure pertain to the field of data communicationsystems and to enforcement of Quality of Service in such systems.

BACKGROUND

A communication system includes a media of limited capacity connecting asource of information (data) to a plurality of users. The media could beeither a wired media or a wireless media. In order to enable all usersto share the limited capacity media, the communication system oftenenforces one or more Quality of Service (QoS) policies. One QoS policy,which is commonly used in communication systems, is maximum informationrate (MIR).

A communication system serving a plurality of users often enforces MIRon more than one level. In such system, MIR has to be enforced both on aper user basis, but also the total information rate must be enforced,often in accordance with the limited capacity of the media. However,when MIR is enforced on more than one level, independently limiting thetransmission information rate at each level often results in undesiredoutcomes.

Enforcing MIR of the media without considering how the limited capacityis being distributed between the multiple users often results in lack offairness between the users. For example, if the MIR value associatedwith one user is twice the MIR value associated with a second user,independent enforcement of the media MIR often results in reducing theinformation rate for both users but without the capacity allocated tothe first user being twice as high as the capacity allocated to thesecond user.

On the other hand, since the media is there, it is desirable to utilizeas much of its available capacity as possible as per the existing demandfrom all users. If the media capacity is distributed between the usersonly in accordance with MIR values associated with the users, whendemand of some users is less than their associated MIR values whiledemand of other users exceeds their associated MIR, the media might beunderutilized while information that could be transmitted over the mediais not transmitted. Instead, it would be desirable to allocate each usermore than its MIR and to maximize the utilization of the availablecapacity. Yet, the available capacity has to be distributed between theusers on a fair basis, e.g. a user which has higher MIR has to gethigher capacity.

BRIEF SUMMARY

The following presents a simplified summary in order to provide a basicunderstanding of some aspects of the disclosure. The summary is not anextensive overview of the disclosure. It is neither intended to identifykey or critical elements of the disclosure nor to delineate the scope ofthe disclosure. The following summary merely presents some aspects ofthe disclosure in a simplified form as a prelude to the descriptionbelow.

Aspects of the disclosure are directed to a method in a communicationsystem comprising a limited capacity media for enforcing maximuminformation rate (MIR) on two or more levels in a hierarchal andextendable manner. A queuing mechanism and an algorithm for at least thepurpose of operating said queuing mechanism are presented herein. Thedisclosed method may help ensure maximum utilization of the availablecapacity over said media as well as fair distribution of said capacitybetween all users regardless of the load (e.g. demand to transmitinformation) over said media. In some embodiments, said queuingmechanism and algorithm may be extended to support enforcement ofcommitted information rate (CIR) as well as maximum information rate(MIR).

Aspects of the disclosure are directed to enforcing maximum informationrate on two or more levels in a hierarchal and extendable manner at twoor more enforcers, wherein the two or more enforcers share a commonmedia.

Aspects of the disclosure are directed to a method in a communicationsystem comprising a limited capacity media for enforcing maximuminformation rate on two or more levels in a hierarchal and extendablemanner, wherein the enforcement is in accordance with information rateeither at the input to the communication system or over said media. Asthe communication system may be configured to process information goingthrough it prior to transmitting it over said media using one or morealgorithms that may alter the information rate (for example compressionalgorithms, encryption algorithms, acceleration algorithms, etc.),selecting the information rate point of reference for at least thepurpose of enforcing a maximum information rate may affect theenforcement results.

Aspects of the disclosure are directed to a method in a communicationsystem comprising a limited capacity media for estimating a load oversaid media. In some embodiments, load may be defined as a ratio betweenan amount of information that may be pending to be transmitted and anamount of information that may be actually transmitted. In someembodiments, once load estimation may be obtained, it may be used foradjusting maximum information rate (MIR) settings within an MIRenforcement mechanism.

BRIEF DESCRIPTION OF THE DRAWINGS

Having thus described the disclosure in general terms, reference willnow be made to the accompanying drawings, which are not necessarilydrawn to scale, and wherein:

FIG. 1 shows an example of a communication system in accordance withaspects of the disclosure.

FIG. 2 shows a first example of a queuing mechanism in accordance withaspects of the disclosure.

FIG. 3 shows a second example of a queuing mechanism in accordance withaspects of the disclosure.

DETAILED DESCRIPTION

FIG. 1 shows an example communication system 100, which may beconfigured to allow transmission of (data) information from one or moreinformation sources 110 a-j, which may be connected to communicationsystem 100 directly and/or via network 120, to one or more users(typically a plurality of users 150 a-n) over limited capacity media140. Media 140 may be either a wired media (e.g. a cable carryingelectric signals and/or an optical fiber carrying optical signals) or awireless media (e.g. a radio link, carrying electromagnetic signals,either directly or via one or more relay stations, for example repeatersor satellites). In addition, communication system 100 may include one ormore information data processors 130 a-k, which may be variouslyconfigured such as to at least enforce one or more Quality of Service(QoS) policies. In some embodiments, one or more of the dataprocessor(s) 130 a-k may be configured to enforce one or more maximuminformation rate (MIR) policies.

In one aspect of the disclosure, one or more data processor(s) 130 a-kmay be configured to enforce maximum information rate (MIR) policies ontwo or more levels in a hierarchal and extendable manner.

Referring to FIG. 2, one or more of the data processor(s) 130 a-k may beconfigured to include and/or use a queuing mechanism such as queuingmechanism 200. FIG. 2 also shows flowchart 210 that may describe analgorithm, which one or more data processor(s) 130 a-k may be configuredto use at least for the purpose of operating queuing mechanism 200. Itis noted that FIG. 2 shows a queuing mechanism with 2 levels of queuing.Similar queuing mechanisms with 3 or more levels may be constructed andsimilar algorithms for operating such similar queuing mechanisms may beused while maintaining the same principles of operation as describedherein and without departing from the scope of the disclosure.

For the sake of simplicity, the description herein may refer to a dataprocessor 130 and to a user 150, wherein data processor 130 may be anyone of the one or more data processor(s) 130 a-k and user 150 may be anyone of the one or more user(s) 150 a-n. This type of simplification mayalso extend to other described elements, where applicable.

Information (e.g. data) from one or more information sources 110 a-j maybe received at data processor 130 as a multiplicity of streams 201 a_(a) to 201 n _(q) using one or more protocols (for example, TCP, UDP,etc.). Furthermore, information destined for any one user 150 may alsobe received as multiple streams using one or more protocols (for examplestreams 201 a _(a) to 201 a _(p) for user 150 a, streams 201 n _(a) to201 n _(q) for user 150 n). In some embodiments, for each of the user(s)150 a-n, one of the data processor 130 a-k may queue informationdestined to that user in a level 2 queue, such as queues 202 a-ncorresponding to user(s) 150 a-n. For example, data processor 130 a mayqueue all information destined to user 150 e in a level 2 queue 202 ecorresponding to user 150 e. In addition, information queued fortransmission over media 140 may be queued in level 1 queue 204 (e.g.,the transmission queue).

Referring to the flow chart in FIG. 2, data processor 130 may employ aperiodic timer or a system tick generator for at least the purpose ofgenerating periodic events at constant intervals (e.g. t), wherein eachevent may trigger another spin of the algorithm. Data processor 130 maybe configured, upon receiving a trigger to start a new spin (220), todetermine whether level 1 queue 204 has room for additional information(230). In some embodiments, the step of determining may be performed forexample by comparing the amount of information queued in level 1 queue204 with threshold level 207 (Thr). In some embodiments, threshold level207 (Thr) may be set so that the amount of information that may bestored in level 1 queue 204 may be sufficient to ensure continuoustransmission of information over media 140 (e.g., avoiding mediastarvation) and the latency that may result from queuing information inlevel 1 queue 204 may be minimized. In some embodiments, threshold level207 (Thr) may reflect an amount of information that may be transmittedover media 140 during a predefined number of intervals (e.g. each ofduration t). In some embodiments, this predefined number of intervalsmay be set quite low, for example to 2 or 3, for at least the purposesof maintaining latency that may be inflicted by queuing mechanism 200relatively low. On the other hand, with each spin of the algorithm,level 1 queue 204 may hold an amount of information which may be severaltimes the amount of information that may be transmitted over media 140during any one spin. In some embodiments, this may help ensurecontinuous transmission of information (e.g. without starvation) and/ormaximum utilization of the capacity over media 140, even in the presenceof some variations in transmission capacity over media 140. Suchvariations may be experienced, for example, in a satellite communicationsystem, wherein media 140 may be an adaptive link having variablethroughput.

Data processor 130 may be further configured, upon determining (230)that level 1 queue 204 may have room for additional information (e.g.the amount of information queued may be lower than threshold level 207(Thr)), to perform one cycle of forwarding information from each level 2queue 202 a-n to level 1 queue 204 (240), wherein the amount ofinformation forwarded from a level 2 queue (e.g. 202 a) may be inaccordance with an MIR figure (e.g. 203 a) associated with a user (e.g.150 a) associated with the first level 2 queue (e.g. 202 a), and inaccordance with said events interval (t). For example, if MIR_(a)corresponding to a user 150 a may be given in, e.g., kilobits per second(Kbps) and said events interval (t) may be given in, e.g., seconds, themaximum amount of information, in e.g., kilobits, that may be forwardedfrom level 2 queue 202 a to level 1 queue 204 in any one forwardingcycle may be calculated as MIR_(a)*t, wherein less or no information maybe forwarded if level 2 queue 202 a may hold less than the calculatedmaximum amount of information or no information at all, respectively.Because in each cycle of forwarding information from level 2 queues 202a-n to level 1 queue 204 the amount of information forwarded from eachlevel 2 queue 202 may be in accordance with the MIR value associatedwith the respective queue, the total capacity of media 140 may be sharedby all users 150 a-n in a fair manner. For example, for any two users,e.g. 150 _(a) and 150 _(b), if MIR_(a) associated with user 150 a is,e.g., M times MIR_(b) associated with user 150 b (e.g.MIR_(a)=M*MIR_(b)), and if the amounts of information forwarded forusers 150 a and 150 b in each forwarding cycle from level 2 queues 202a-n to level 1 queue 204 equal MIR_(a)*t and MIR_(b)*t respectively,then user 150 a may receive information at a rate M times the rate atwhich user 150 b may receive information, regardless of the load onmedia 140. For example, if user 150 a may receive traffic at a ratewhich may be half of the MIR associated with user 150 a (e.g.0.5*MIR_(a)), then user 150 b may receive traffic at a rate which may behalf of the MIR associated with user 150 b (e.g. 0.5*MIR_(b)).

Data processor 130 may be further configured, upon completing aninformation forwarding cycle 240, to determine whether another cycle offorwarding information from level 2 queues 202 a-n to level 1 queue 204may be performed (250), e.g., during the same spin. Data processor 130may be configured to perform another information forwarding cycle 240 iflevel 1 queue 204 may have room for additional information (e.g. if theamount of information queued in level 1 queue 204 may be lower thanthreshold level 207 (Thr)) and if at least one of the level 2 queues 202a-n may still have queued information. Data processor 130 may be soconfigured at least for the purpose of utilizing the capacity availableover media 140 as much as possible when communication system 100 may beunder-utilized. Though this may imply transmitting information towardsone or more users 150 a-n at rates higher than their respectivelyassociated MIR values, still fairness between a plurality of users e.g.,150 a-n may be maintained as previously described.

Furthermore, data processor 130 may be configured, upon determining thatno (additional) information may be forwarded from level 2 queues 202 a-nto level 1 queue 204, to forward information from level 1 queue 204towards media 140 (e.g., as in step 260). In some embodiments, theamount of information forwarded from level 1 queue 204 towards media 140in any one forwarding cycle (e.g., spin) may be in accordance with avalue of MIR_(T) (205), which may be set in accordance with the capacityof media 140, and in accordance with the events interval (t). Forexample, if MIR_(T) may be given in, e.g., kilobits per second (Kbps)and the said events interval (t) may be given in, e.g., seconds, themaximum amount of data, in, e.g., kilobits, that may be forwarded fromlevel 1 queue 204 towards media 140 in any one forwarding cycle (e.g.,spin) may be calculated as MIR_(T)*t, wherein less information may beforwarded if level 1 queue 204 may hold less than the calculated maximumamount of information. In some embodiments, connectivity between dataprocessor 130 and media 140 may be in accordance with a protocol whereinone or more flow control mechanisms may be used. In such embodiments, itmay be up to media 140 to control the forwarding of information formlevel 1 queue 204. Thus, the amount of information that may be forwardedfrom level 1 queue 204 towards media 140 in a forwarding cycle (spin)may be lower than said calculated maximum amount of information, atleast due to use of, for example, flow control mechanisms by media 140.For example, assuming that a calculated maximum amount of informationthat may be forwarded from level 1 queue 204 towards media 140 in aforwarding cycle (spin) may be X kilobits, that level 1 queue 204 mayhold at least 2X kilobits of information queued, and that at a currentinformation forwarding cycle (e.g., spin) only Y kilobits (Y<X) may beforwarded (e.g. due to flow control by media 140). In that example, atthe next information forwarding cycle X kilobits may be forwarded (e.g.if no flow control may be used by media 140), wherein these X kilobitsmay include the X-Y kilobits left from the previous informationforwarding cycle.

It is noted that data processor 130 may determine that no informationmay be forwarded from level 2 queues 202 a-n to level 1 queue 204 at thebeginning of an algorithm spin, e.g. immediately after occurrence ofsaid periodic event (e.g., at step 230), e.g. due to determining thatlevel 1 queue 204 may have no room for additional information (e.g. theamount of information queued may be higher than or equal to thresholdlevel 207 (Thr)). In that case, no information may be forwarded fromlevel 2 queues 202 a-n to level 1 queue 204 during that spin of thealgorithm and the only action that may be taken during that spin may bethe forwarding of information from level 1 queue 204 towards media 140.Thus, as the load on communication system 100 and/or on media 140becomes higher, the algorithm presented herein may actually utilize lessof data processor 130 processing resources.

In addition, spins of the algorithm in which information may beforwarded only from level 1 queue 204 towards media 140 (e.g. withoutforwarding information from level 2 queues 202 a-n towards level 1 queue204) may have the effect of reducing the effective MIRs of all users 150a-n while fully utilizing the available capacity over media 140. Forexample, if no forwarding of information from level 2 queues 202 a-n tolevel 1 queue 204 occurs in one of every two spins, the effective MIRfor each user may be reduced by 50% while keeping media 140 fullyutilized and while distributing the capacity of media 140 between one ormore user(s) 150 a-n in a fair manner and in accordance with therespective MIR values associated with the one or more user(s) 150 a-n.

In some embodiments of the algorithm previously discussed, a differentorder of forwarding information may be exercised. For example, the stepof forwarding information from level 1 queue 204 towards media 140(e.g., step 260) may be performed prior to the steps of determiningwhether level 1 queue 204 may have room for additional information(e.g., step 230) and the other steps following said determining (e.g.steps 240 and 250). However, this variation may have insignificant or noeffect on the behavior of the entire mechanism, as previously described.

Furthermore, queuing mechanism 200 and the algorithm described byflowchart 210 may be extended to support more than two enforcementlevels without departing from the scope of the disclosure.

In one embodiment, a third level of enforcement may be added tomechanism 200 by adding a layer 3 queue for each TCP connection orstream, wherein each layer 3 queue may be associated with a TCP MIR. Itmay be noted that such embodiment may be based on using one or more flowcontrol methods for slowing down and/or pausing the flow of TCP trafficwhen a layer 3 queue is filling up or becoming full and may not holdadditional information.

In the above described embodiment, the relationship between layer 3queues associated with streams of information destined to a user 150 anda layer 2 queue 202 associated with the same user 150 may be similar tothe relationship previously described between layer 2 queues 202 a-n andlayer 1 queue 204. Each layer 2 queue 202 may be associated with athreshold (e.g. Thr2_(a), to Thr2_(n)). For each spin of the algorithm,data processor 130 may first determine for each layer 2 queue 202whether it may have room for additional information (e.g. by determiningwhether the amount of information queued may be lower than therespective threshold level (Thr2)). For each layer 2 queue 202 havingroom for additional information, data processor 130 may perform one ormore cycles of forwarding information from the respective layer 3 queuesto the layer 2 queue 202 in accordance with the respective TCP MIRvalues, until the respective threshold level (Thr2) is reached orexceeded. Once all layer 2 queues 202 a-n are handled and no moreinformation may be forwarded from layer 3 queues to layer 2 queues 202a-n, data processor 130 may perform the algorithm in reference to layer2 queues 202 a-n and layer 1 queue 204 as previously described.

In another embodiment, a third level of enforcement may be added tomechanism 200 by adding a layer of queues between layer 1 and layer 2.Such embodiment may be used, for example, for enforcing MIR on groups ofusers. In such embodiment, the user level queues may become the layer 3queues, the queues associated with groups of users may become layer 2queues and layer 1 queue 204 may remain as previously described. Thusthe workings of this embodiment may be similar to those previouslydescribed.

In some embodiments, queuing mechanism 200 and the algorithm describedby flowchart 210 may be extended to support enforcement of committedinformation rate (CIR). A CIR assignment may be used for ensuring aminimal information rate at each level but level 1 (e.g. either for auser 150 or for a group of users in case of a 3-levels enforcementembodiment), as long as the entire capacity over media 140 may not beover committed to CIR assignments.

Referring to FIG. 3, one or more of data processor(s) 130 a-k may beconfigured to include and/or use queuing mechanism 300, which may besimilar to queuing mechanism 200 with perhaps the addition of applicableCIR assignments (303) and with an additional CIR threshold level 307(ThrC) in reference to level 1 queue 204. Furthermore, FIG. 3 showsflowchart 310 that may describe an algorithm, which one or more of dataprocessor(s) 130 a-k may be configured to use at least for the purposeof operating queuing mechanism 300.

At least for the purpose of enforcing CIR, CIR threshold level 307(ThrC) may be used in reference to level 1 queue 204, wherein CIRthreshold level 307 may be set higher than MIR threshold level 207 (e.g.ThrC>Thr). In some embodiment, CIR threshold level 307 (ThrC) mayreflect an amount of information that may be transmitted over media 140during a second predefined number of triggering intervals (e.g. each ofduration t), wherein the second predefined number of intervals isgreater than the predefined number of intervals that may be used fordetermining MIR threshold level 207 (Thr). In some embodiments, whereinthe number of said intervals for determining MIR threshold level 207(Thr) may be set to 2 or 3, said second predefined number of intervalsfor determining CIR threshold level 307 (ThrC) may be set to 5.

Furthermore, data processor 130 may be configured for each spin of thealgorithm (320) to determine whether the amount of information queued inlayer 1 queue 204 (e.g. Q_(m)) may be either lower than MIR thresholdlevel 207 (e.g. Q_(m)<Thr<ThrC) (330), higher than or equal to MIRthreshold level 207 but lower than CIR threshold level 307 (e.g.Thr≤Q_(m)<ThrC) (step 350), or higher than or equal to CIR thresholdlevel 307 (e.g. Thr<ThrC≤Q_(m)) (step 370). If the amount of informationqueued in layer 1 queue 204 (e.g. Q_(m)) may be lower than MIR thresholdlevel 207 (e.g. Q_(m)<Thr<ThrC) (step 330), data processor 130 may beconfigured to forward information from layer 2 queues 202 a-n to layer 1queue 204 in accordance with MIR values 203 a-n associated with layer 2queues 202 a-n (step 340). If the amount of information queued in layer1 queue 204 may be higher than or equal to MIR threshold level 207 butlower than CIR threshold level 307 (e.g. Thr≤Q_(m)<ThrC) (step 350),data processor 130 may be configured to forward information from layer 2queues 202 a-n to layer 1 queue 204 in accordance with CIR values 303a-n associated with layer 2 queues 202 a-n (step 360). However, if theamount of information queued in layer 1 queue 204 (e.g. Q_(m)) may behigher than or equal to CIR threshold level 307 (e.g. Thr<ThrC≤Q_(m)),data processor 130 may be configured to forward information from layer 2queues 202 a-n to layer 1 queue 204 in accordance with CIR values 303a-n associated with layer 2 queues 202 a-n (step 380) only if the amountof information that may be queued in layer 1 queue 204 at the beginningof the current spin (e.g. Q_(m)) may be lower than the amount ofinformation that may have been queued in layer 1 queue 204 at thebeginning of a last spin in which information may have been forwardedfrom layer 2 queues 202 a-n to layer 1 queue 204 based on CIR values 303a-n (e.g. Q_(m-r), wherein r≥1 and wherein Thr<ThrC≤Q_(m)<Q_(m-r)) (step370). In addition, once forwarding of information from level 2 queues202 a-n to level 1 queue 204 is complete, data processor 130 may beconfigured to forward information from level 1 queue 204 towards media140 (step 390), as previously described in reference to step 260 offlowchart 210. Thus, when the demand for transmitting information overmedia 140 may exceed the available capacity (e.g. media 140 may beoverloaded) and the effective MIRs of users 150 a-n may be reduced (aspreviously described), the above described mechanism may ensure thateach user 150 may receive information at a rate not lower than itsassociated CIR value, at least as long as the entire capacity over media140 may not be over committed to CIR assignments. On the other hand,when the entire capacity of media 140 may be over committed to CIRassignments, media 140 may be fully utilized and its capacity may bedistributed between one or more users 150 a-n in a fair manner and inaccordance with the respective CIR values associated with one or moreusers 150 a-n.

Regarding the above, two points may be noted. First, regarding theforwarding of information from layer 2 queues 202 a-n to layer 1 queue204, in each spin either information may be forwarded in accordance onlywith MIR values 203 a-n, or information may be forwarded in accordanceonly with CIR values 202 a-n, or no information may be forwarded at all.Second, the recording of the amount of information that may have beenqueued in layer 1 queue 204 at the beginning of a last spin (e.g.Q_(m-r)) may be updated in each spin at which information may beforwarded from layer 2 queues 202 a-n to layer 1 queue 204 (e.g., steps340, 360, and/or 380). In a spin where information may be forwarded fromlayer 2 queues 202 a-n to layer 1 queue 204 based on CIR values 303 a-n(e.g., steps 360, 380), said recorded amount of informationcorresponding to a last spin may be set to the amount of informationthat may have been queued in layer 1 queue 204 at the beginning of thecurrent spin (e.g. Q_(m-r)=Q_(m)). In a spin where information may beforwarded from layer 2 queues 202 a-n to layer 1 queue 204 based on MIRvalues 203 a-n (step 340), said recorded amount of informationcorresponding to a last spin may be set to a sufficiently high value(e.g. Q_(m-r)=MAX), for example a value greater than the maximum size oflevel 1 queue 204. Thus, if between a current spin and a said last spinthere may have been one or more spins in which information may have beenforwarded from layer 2 queues 202 a-n to layer 1 queue 204 based on MIRvalues 203 a-n, condition 370 (e.g. Q_(m)<Q_(m-r)) may be true and aforwarding information cycle from layer 2 queues 202 a-n to layer 1queue 204 based on CIR values 303 a-n (step 380) may be performed. Thus,forwarding of information from layer 2 queues 202 a-n to layer 1 queue204 in accordance with CIR values 303 a-n may be allowed as long asthere may be no CIR overbooking, e.g. as long as the amount ofinformation forwarded from level 2 queues 202 a-n to level 1 queue 204in accordance with CIR values 303 a-n may be lower than the amount oftraffic that may be forwarded from level 1 queue 204 towards media 140.

In another aspect of the disclosure, communication system 100 may beconfigured to enforce maximum information rate on two or more levelsusing two or more data processors 130 a to 130 k, wherein the two ormore data processors 130 a to 130 k share common media 140. In someembodiments, system 100 may be further configured to divide theplurality of users 150 a-n between said data processors 130 a to 130 kso that each user 150 may be serviced by a single one of the one or moreof data processor(s) 130 a-k.

Each of data processors 130 a-k may be configured to include and/or usea queuing mechanism as shown in FIG. 2 (200) or as shown in FIG. 3 (300)and to use an algorithm as described in flowchart 210 or in flowchart310 for at least the purpose of operating said queuing mechanism. Inaddition, connectivity between the data processors 130 a-k and media 140may be in accordance with a protocol wherein one or more flow controlmechanisms may be used. Thus the amount of information that may beforwarded by a data processor 130 towards media 140 in a forwardingcycle may be lower than the amount of information that data processor130 may attempt to forward at that cycle, at least due to use of saidflow control mechanisms by media 140.

Furthermore, for each of the data processor 130 a-k, MIR value 205 (e.g.MIR_(T)) which may be associated with its level 1 queue 204 may be setin accordance with the full capacity of media 140. Thus, each one ofdata processors 130 a-k (e.g. 130 a) may utilize the entire capacity ofmedia 140 in case the one or more other data processors (e.g. 130 b to130 k) may be idling and/or forwarding no information towards media 140.Consequently, for each spin, each of the data processors 130 a-k mayattempt to forward information from its level 1 queue 204 towards media140 in accordance with the full capacity of media 140, though thatentire capacity may not be fully available to each of the dataprocessors 130 a-k.

However, whenever two or more data processors 130 a to 130 k may attemptto forward a total amount of information which exceeds the amount ofinformation that may be transmitted over media 140, the flow controlmechanisms of media 140 may be activated and the two or more dataprocessors 130 a to 130 k may be slowed down to insure that informationmay not be lost due to saturation of media 140.

In some embodiments, a 2-level queuing mechanism as previously describedmay be used between data processors 130 a-k and media 140 (not shown inFIG. 1), for at least the purpose of connecting the multiplicity of dataprocessors 130 a-k to media 140. In these embodiments, there may be noneed for any additional flow control mechanisms between data processors130 a-k and media 140, as said queuing mechanism may support all theflow control that may be needed. In addition, using another queuingmechanism may guarantee not only maximum utilization of the capacity ofmedia 140 but also fair distribution of that capacity between dataprocessors 130 a-k.

In yet another aspect of the disclosure, at least one of the one or moreof data processor(s) 130 a-k may be configured to enforce maximuminformation rate on two or more levels, wherein enforcement may be inaccordance with information rates either at the input to the at leastone of the one or more of data processor(s) 130 a-k (e.g. at the inputto communication system 100) or at the output of the at least one of theone or more of data processor(s) 130 a-k (e.g. over media 140).

In addition to enforcing maximum information rate on two or more levels,data processor 130 may be configured to process information goingthrough it prior to scheduling it for transmission over media 140. Insome embodiments, said processing may occur prior to queuing saidinformation in level 2 queues 202 a-n. In some embodiments, saidprocessing of information may include using any one or more algorithmsthat may alter the information rate (for example compression algorithms,encryption algorithms, acceleration algorithms, etc.). Thus, selectingthe information rate point of reference for at least the purpose ofenforcing a maximum information rate may affect the enforcement results.

In some embodiments, data processor 130 may be configured to select theinformation rate point of reference to be at its input, e.g. prior tosubjecting the information it received to any algorithm which may alterthe information rate. In such embodiments, a user (e.g. 150 a) mayreceive information at a rate higher than the maximum information rate(e.g. 203 a) associated with said user only at times when communicationsystem 100 may be under-utilized (e.g. referring to FIG. 2, whencondition 250 may be true). In addition, any reduction in the amount ofinformation actually transmitted over media 140 towards said user (e.g.150 a), for example due to any one or more compression/decompression oroptimization methods that data processor 130 and any reception device atthe user end may be configured to use, may not be visible to said user(e.g. 150 a). Instead, any capacity gained over media 140 (for example,due to using any one or more of said methods) may be used bycommunication system 100 for at least the purpose of transmittinginformation destined for other users (e.g. 150 b to 150 n) over media140.

Wherein data processor 130 may be configured to select the informationrate point of reference to be at its input, data processor 130 may bealso configured to attach to each unit of information (e.g. aninformation packet) inserted into level 2 queue 202 either an indicationof its original size (e.g. prior to applying any information ratealtering algorithms) or an information rate change ratio that mayreflect the ratio between the current size of the information unit andits original size. Furthermore, data processor 130 may be configured,upon any forwarding of information from level 2 queues 202 a-n to level1 queue 204 to determine the amount of information to forward inaccordance with said original size indications or information ratechange ratios that may be attached to one or more information units thatmay be forwarded.

In some embodiments, data processor 130 may be configured to select theinformation rate point of reference to be at its output, e.g. aftersubjecting the information it received to any algorithm which may alterthe information rate. In such embodiments, an MIR value (e.g. 203 a)associated with a user (e.g. 150 a) may define a maximum informationrate for said user over media 140. Thus, by using any one or morecompression/decompression or optimization methods at data processor 130and at any reception device at the user end, said user (e.g. 150 a) mayreceive information at a rate higher than the maximum information rate(e.g. 203 a) associated with said user not only at times whencommunication system 100 may be under-utilized but also at other times.Any reduction in the amount of information actually transmitted overmedia 140 towards said user (e.g. 150 a), for example due to employingsaid methods, may be visible to said user and may be used by said userfor receiving more information.

Wherein data processor 130 may be configured to select the informationrate point of reference to be at its output, data processor 130 may beconfigured to enforce maximum information rate on two or more levels inaccordance with the methods already described above.

In additional aspect of the disclosure, one or more of data processor(s)130 a-k may be configured to estimate a load over media 140.

Data processor 130 may be configured to enforce maximum information rateon two or more levels as previously described, for example using queuingmechanism 200 and an algorithm as shown in flowchart 210 and previouslydescribed above. For each spin of the algorithm, data processor 130 maydetermine whether information may be forwarded from level 2 queues 202a-n to level 1 queue 204 in this spin. Upon determining that informationmay be forwarded from level 2 queues 202 a-n to level 1 queue 204 inthis spin, data processor 130 may be configured to determine the totalamount of information (e.g. Info_(T)) forwarded to level 1 queue 204from all level 2 queues 202 a-n in this spin. Data processor 130 may befurther configured to then calculate a (current) load on media 140 bydividing said determined total amount of information (e.g. Info_(T)) bythe maximum amount of information 205 (e.g. MIR_(T)) that may beforwarded from level 1 queue 204 towards media 140 in a forwarding cycle(spin) (e.g. Load=Info_(T)/MIR_(T)). It may be noted that upondetermining that information may not be forwarded from level 2 queues202 a-n to level 1 queue 204 in this spin, data processor 130 may beconfigured not to determine said total amount of information (e.g.Info_(T)) and not to calculate a (current) load on media 140 in thisspin. Thus, as load may be estimated only in spins in which informationmay be forwarded from level 2 queues 202 a-n to level 1 queue 204 (e.g.in accordance with MIR values associated with the respective users) andwhile ignoring any limitation of capacity over media 140, the estimatedload may reflect the real load on media 140, e.g. in accordance with thetotal demand for transmitting information to all users (which may exceedthe total capacity available over media 140), rather than in accordancewith an actual rate at which information may be transmitted over media140 (which may be limited to the capacity available over media 140).

In some embodiments, where queuing mechanism 200 may be configured toinclude more than two enforcement levels, the above described method maybe used for estimating load at any of the queuing levels except maybefor the first queuing level (e.g. the level associated with the users).For example, in case of using a queuing mechanism with 3 levels, theabove described method may be used for estimation load on the output ofthe level 1 queue and on each of the outputs of the level 2 queues.

In some embodiments, media 140 may occasionally experience variances incapacity (for example, a radio link that may occasionally fade). Using amaximum amount of information 205 (e.g. MIR_(T)) value, when theavailable capacity over media 140 may be different from that which maybe assumed for calculating said maximum amount of information 205, mayresult in inaccurate estimations. In such embodiments, wherein theavailable capacity over media 140 may be measured or estimated by meansexternal to data processor 130, data processor 130 may be configured toreceive periodic and/or occasional estimations of available capacityover media 140, and to update in real-time or substantially in real-timesaid maximum amount of information 205 (e.g. MIR_(T)) in accordance withsaid received estimations, for at least the purpose of correctlyestimating a load on media 140. In some embodiments, in addition to saidupdating of maximum amount of information 205 (e.g. MIR_(T)), dataprocessor 130 may be further configured to also update threshold level207 (Thr) that may be associated with level 1 queue 204, in accordancewith said received estimations and/or in accordance with updated maximumamount of information 205, for example as previously described.

In some embodiments, once a load on media 140 may be estimated, dataprocessor 130 may be configured to use said load estimation for at leastthe purpose of adjusting maximum information rate settings (e.g. 203)within said maximum information rate enforcement mechanism.

In some embodiments, a satellite communication system may comprise acentral station (e.g. a hub) that may include one or more processors(that may correspond to data processors 130 a-k) and a plurality ofterminals (that may correspond to users 150 a-n). Said satellitecommunication system may be configured to use a limited capacitysatellite link (that may correspond to media 140) for transmittinginformation received at the central station from one or more informationsources (110) to said plurality of terminals. Furthermore, saidsatellite communication system may be configured to use one or more ofthe methods previously described.

Various aspects of the disclosure may be embodied as one or moremethods, systems, apparatuses (e.g., components of a satellitecommunication network), and/or computer program products. Accordingly,those aspects may take the form of an entirely hardware embodiment, anentirely software embodiment, an entirely firmware embodiment, or anembodiment combining firmware, software, and/or hardware aspects.Furthermore, such aspects may take the form of a computer programproduct stored by one or more computer-readable storage media havingcomputer-readable program code, or instructions, embodied in or on thestorage media. Any suitable computer readable storage media may beutilized, including hard disks, CD-ROMs, optical storage devices,magnetic storage devices, and/or any combination thereof. In someembodiments, one or more computer readable media storing instructionsmay be used. The instructions, when executed, may cause one or moreapparatuses to perform one or more acts described herein. The one ormore computer readable media may comprise transitory and/ornon-transitory media. In addition, various signals representing data orevents as described herein may be transferred between a source and adestination in the form of electromagnetic waves traveling throughsignal-conducting media such as metal wires, optical fibers, and/orwireless transmission media (e.g., air and/or space).

Modifications may be made to the various embodiments described herein bythose skilled in the art. For example, each of the elements of theaforementioned embodiments may be utilized alone or in combination orsub-combination with elements of the other embodiments. It will also beappreciated and understood that modifications may be made withoutdeparting from the true spirit and scope of the present disclosure. Thedescription is thus to be regarded as illustrative instead ofrestrictive on the present disclosure.

What is claimed is:
 1. One or more non-transitory computer readablestorage media storing computer-executable instructions that, whenexecuted by a data processor, cause the data processor to: receiveinformation to be transmitted to a plurality of destinations over acapacity limited media; queue the received information in a plurality ofhigher level queues corresponding to the plurality of destinations,respectively, wherein each of the higher level queues is associated witha maximum information rate value of the corresponding destination;forward information from each of the higher level queues to acorresponding lower level queue in accordance with the maximuminformation rate value associated with the corresponding higher levelqueue; and forward information from a first level queue towards thecapacity limited media in accordance with a maximum information ratevalue associated with the first level queue.
 2. The one or morenon-transitory computer readable storage media of claim 1, wherein thereceived information comprises a multiplicity of streams using one ormore protocols.
 3. The one or more non-transitory computer readablestorage media of claim 1, wherein the information forwarded from each ofthe higher level queues to the corresponding lower level queue isforwarded in a first part of a spin, wherein the information forwardedfrom the first level queue towards the capacity limited media isperformed in a second part of the spin.
 4. The one or morenon-transitory computer readable storage media of claim 1, wherein anamount of information forwarded from each of the higher level queuesduring any one cycle is less than or equal to an amount based on themaximum information rate value associated with the corresponding higherlevel queue and an interval between spins.
 5. The one or morenon-transitory computer readable storage media of claim 1, wherein thecomputer-executable instructions, when executed, cause the dataprocessor to: prior to forwarding information from each of the higherlevel queues, determine whether the corresponding lower level queue hasroom to store data; perform one cycle of forwarding information fromeach of the higher level queues to the corresponding lower level queueif the corresponding lower level queue has room to store data; afterforwarding information from each of the higher level queues, determinewhether the corresponding lower level queue still has room to storedata; and perform an additional cycle of forwarding information fromeach of the higher level queues to the corresponding lower level queueif the corresponding lower level queue still has room to store data. 6.The one or more non-transitory computer readable storage media of claim1, wherein the computer-executable instructions, when executed, furthercause the data processor to: forward information from each of the higherlevel queues to the corresponding lower level queue in accordance with acommitted information rate value associated with the correspondinghigher level queue.
 7. The one or more non-transitory computer readablestorage media of claim 1, wherein the computer-executable instructions,when executed, cause the data processor to: forward first informationfrom a first higher level queue, among the plurality of higher levelqueues, to a first lower level queue; and while forwarding the firstinformation, forward second information from a second higher levelqueue, among the plurality of higher level queues, to a second lowerlevel queue.
 8. The one or more non-transitory computer readable storagemedia of claim 1, wherein the computer-executable instructions, whenexecuted, cause the data processor to: forward first information from afirst higher level queue, among the plurality of higher level queues, tothe first level queue; and while forwarding the first information,forward second information from a second higher level queue, among theplurality of higher level queues, to the first level queue.
 9. A methodcomprising: receiving information to be transmitted to a plurality ofdestinations over a capacity limited media; queuing the receivedinformation in a plurality of higher level queues corresponding to theplurality of destinations, respectively, wherein each of the higherlevel queues is associated with a maximum information rate value of thecorresponding destination; forwarding information from each of thehigher level queues to a corresponding lower level queue in accordancewith the maximum information rate value associated with thecorresponding higher level queue; and forwarding information from afirst level queue towards the capacity limited media in accordance witha maximum information rate value associated with the first level queue.10. The method of claim 9, wherein the receiving the informationcomprises receiving a multiplicity of streams using one or moreprotocols.
 11. The method of claim 9, wherein the forwarding informationfrom each of the higher level queues to the corresponding lower levelqueue comprises forwarding, in a first part of a spin, information fromeach of the higher level queues to the corresponding lower level queue,and wherein the forwarding information from the first level queuetowards the capacity limited media comprises forwarding, in a secondpart of the spin that follows the first part of the spin, informationfrom the first level queue towards the capacity limited media.
 12. Themethod of claim 11, wherein the spin is a periodic spin.
 13. The methodof claim 9, wherein an amount of information forwarded from each of thehigher level queues during any one cycle is less than or equal to anamount based on the maximum information rate value associated with thecorresponding higher level queue and an interval between spins.
 14. Themethod of claim 9, wherein the forwarding information from each of thehigher level queues to the corresponding lower level queue comprises:determining whether the corresponding lower level queue has availablestorage; performing a first cycle of forwarding information from each ofthe higher level queues to the corresponding lower level queue if thecorresponding lower level queue has available storage; after performingthe first cycle, determining whether the corresponding lower level queuestill has available storage; and performing a second cycle of forwardinginformation from each of the higher level queues to the correspondinglower level queue if the corresponding lower level queue still hasavailable storage.
 15. The method of claim 14, wherein the forwardinginformation from the first level queue towards the capacity limitedmedia comprises performing, in response to determining that there is noavailable storage in the first level queue, a single cycle of forwardinginformation from the first level queue towards the capacity limitedmedia.
 16. The method of claim 9, further comprising forwardinginformation from each of the higher level queues to the correspondinglower level queue in accordance with a committed information rate valueassociated with the corresponding higher level queue.
 17. The method ofclaim 9, wherein the forwarding information from each of the higherlevel queues to the corresponding lower level queue comprises forwardinginformation from each of the higher level queues to the first levelqueue.
 18. The method of claim 9, wherein the forwarding informationfrom each of the higher level queues to the corresponding lower levelqueue comprises forwarding information from each of the higher levelqueues to a plurality of lower level queues, and wherein the methodfurther comprises forwarding information from each of the lower levelqueues to the first level queue.
 19. A method comprising: receiving, bya data processor, information to be transmitted to a plurality ofdestinations over a media; queuing the received information in aplurality of higher level queues corresponding to the plurality ofdestinations, respectively; forwarding a first portion of theinformation from at least one of the higher level queues to acorresponding lower level queue in accordance with a first maximuminformation rate value associated with the at least one higher levelqueue; determining an estimated maximum information rate value; andforwarding at least the first portion of the information from a firstlevel queue towards the media in accordance with the estimated maximuminformation rate value.
 20. The method of claim 19, wherein theforwarding the first portion of the information from the at least one ofthe higher level queues to the corresponding lower level queue comprisesforwarding, in a first part of a periodic spin, the first portion of theinformation from the at least one of the higher level queues to thecorresponding lower level queue, and wherein the forwarding the at leastthe first portion of the information from the first level queue towardsthe media comprises forwarding, in a second part of the periodic spinafter the first part of the periodic spin, the at least the firstportion of the information from the first level queue towards the media.21. A method comprising: receiving first information to be transmitted,over a capacity limited media, to a first destination, and secondinformation to be transmitted, over the capacity limited media, to asecond destination; queuing, based on the first destination and thesecond destination, the first information in a first higher level queueand the second information in a second higher level queue, wherein thefirst higher level queue is associated with a first maximum informationrate value of the first destination, and wherein the second higher levelqueue is associated with a second maximum information rate value of thesecond destination; forwarding the first information from the firsthigher level queue to a first lower level queue in accordance with thefirst maximum information rate value and the second information from thesecond higher level queue to a second lower level queue in accordancewith the second maximum information rate value; and forwarding the firstinformation and the second information from a first level queue towardsthe capacity limited media in accordance with a third maximuminformation rate value associated with the first level queue.
 22. Acommunication system comprising one or more data processors coupled to alimited capacity media, each data processor configured to: receiveinformation destined to a plurality of destinations; queue the receivedinformation in a plurality of higher level queues corresponding to theplurality of destinations, respectively, wherein each of the higherlevel queues is associated with a maximum information rate value of thecorresponding destination; forward information from each of the higherlevel queues to a corresponding lower level queue in accordance with themaximum information rate value associated with the corresponding higherlevel queue; and forward information from a first level queue towardsthe limited capacity media in accordance with a maximum information ratevalue associated with the first level queue.